Subgame-Perfect Equilibria for Stochastic Games
نویسندگان
چکیده
For an n-person stochastic game with Borel state space S and compact metric action sets A1, A2, . . . , An, sufficient conditions are given for the existence of subgame perfect equilibria. One result is that such equilibria exist if the law of motion q(·|s, a) is, for fixed s, continuous in a = (a1, a2, . . . , an) for the total variation norm and the payoff functions f1, f2, . . . , fn are bounded, Borel measurable functions of the sequence of states (s1, s2, . . .) ∈ SN and, in addition, are continuous when SN is given the product of discrete topologies on S.
منابع مشابه
Computing equilibria in discounted dynamic games
Game theory (GT) is an essential formal tool for interacting entities; however computing equilibria in GT is a hard problem. When the same game can be played repeatedly over time, the problem becomes even more complicated. The existence of multiple game states makes the problem of computing equilibria in such games extremely difficult. In this paper, we approach this problem by first proposing ...
متن کاملSubgame Perfection for Equilibria in Quantitative Reachability Games
We study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In such games, each player aims at reaching his own goal set of states as soon as possible. A previous work on this model showed that Nash equilibria (resp. secure equilibria) are guaranteed to exist in the multiplayer (resp. two-player) case. The existence of secure equilibria ...
متن کاملOn (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games
We study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In such games, each player aims at reaching his own goal set of states as soon as possible. A previous work on this model showed that Nash equilibria (resp. secure equilibria) are guaranteed to exist in the multiplayer (resp. two-player) case. The existence of secure equilibria ...
متن کاملPure subgame-perfect equilibria in free transition games
We consider a class of stochastic games, where each state is identified with a player. At any moment during play, one of the players is called active. The active player can terminate the game, or he can announce any player, who then becomes the active player. There is a non-negative payoff for each player upon termination of the game, which depends only on the player who decided to terminate. W...
متن کاملSubgame perfect equilibria in stopping games
Stopping games (without simultaneous stopping) are sequential games in which at every stage one of the players is chosen according to a stochastic process, and that player decides whether to continue the interaction or stop it, whereby the terminal payoff vector is obtained by another stochastic process. We prove that if the payoff process is integrable, a δ-approximate subgame perfect -equilib...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Oper. Res.
دوره 32 شماره
صفحات -
تاریخ انتشار 2007